Epistemic ATL with Perfect Recall, Past and Strategy Contexts
نویسندگان
چکیده
We propose an extension to epistemic ATL with perfect recall, past, and distributed knowledge by strategy contexts and demonstrate the strong completeness of a Hilbert-style proof system for its (.U.)-free subset.
منابع مشابه
Agents that Know How to Play
We look at ways to enrich Alternating-time Temporal Logic (ATL) – a logic for specification and verification of multi-agent systems – with a notion of knowledge. Starting point of our study is a recent proposal for a system called Alternating-time Temporal Epistemic Logic (ATEL). We show that, assuming that agents act under uncertainty in some states of the system, the notion of allowable strat...
متن کاملATL* With Truly Perfect Recall: Expressivity and Validities
In alternating-time temporal logic ATL, agents with perfect recall assign choices to sequences of states, i.e., to possible finite histories of the game. However, when a nested strategic modality is interpreted, the new strategy does not take into account the previous sequence of events. It is as if agents collect their observations in the nested game again from scratch, thus effectively forget...
متن کاملThe Expressive Power of Epistemic $μ$-Calculus
While the μ-calculus notoriously subsumes Alternating-time Temporal Logic (ATL), we show that the epistemic μ-calculus does not subsume ATL with imperfect information (ATLi), for the synchronous perfect-recall semantics. To prove this we first establish that jumping parity tree automata (JTA), a recently introduced extension of alternating parity tree automata, are expressively equivalent to th...
متن کاملThe Expressive Power of Epistemic $\mu$-Calculus
While the μ-calculus notoriously subsumes Alternating-time Temporal Logic (ATL), we show that the epistemic μ-calculus does not subsume ATL with imperfect information (ATLi), for the synchronous perfect-recall semantics. To prove this we first establish that jumping parity tree automata (JTA), a recently introduced extension of alternating parity tree automata, are expressively equivalent to th...
متن کاملDecidability Results for ATL* with Imperfect Information and Perfect Recall
Alternating-time Temporal Logic (ATL∗) is a central logic for multiagent systems. Its extension to the imperfect information setting (ATLi ) is well known to have an undecidable model-checking problem when agents have perfect recall. Studies have thus mostly focused either on agents without memory, or on alternative semantics to retrieve decidability. In this work we establish new decidability ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012